Introduction to Queuing Networks; E. Gelenbe, G. Pujolle
نویسنده
چکیده
It is not an easy task to write a book on queuing networks when a large number of books in the topic have already been published. The authors have written a very timely book on queuing networks which can be used by people working in the area of communication networks. The basics of stochastic process have been discussed in Chapter 1 with queuing networks being introduced in Chapter 2 where the authors discuss Jackson’s network. The example showing the analysis of a virtual memory in a computer system is useful in understanding the material in this chapter. The traditional queuing theory is introduced in Chapter 3 where state-dependent queues, queues with multiple servers, queues with batch arrivals, and priority queues are discussed. The material on priority queues could be helpful for those dealing with communication networks where packets can have different priorities. Several techniques to solve queuing networks are given in Chapter 5 along with an example of a study of computer networks with virtual circuits. Chapter 6 deals with flows in networks where the authors have discussed M/M/1 queues with feed back and shown how to obtain the various queue parameters. Chapters 7 and 8 discuss G-networks where two classes of customers (positive and negative customers) are considered. The positive customers could be packets in a queue whereas the negative customers do not queue up in the queue but can initiate the departure of a packet from the queue. Applications of this type of networks using a communication system having flow control have been shown. Finally, the book concludes with a discussion of discrete time queuing systems where all arrivals and departures happen at discrete events of time such as that in ATM networks. The book would be very suitable for graduate students in Computer Science, Computer Engineering or Electrical Engineering. It will also be invaluable as a reference book for practicing engineers. More examples throughout the chapters would certainly make it very attractive as a text book.
منابع مشابه
Longest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملThe AutoI approach for the orchestration of autonomic networks
Existing services require assurable endto-end quality of service, security and reliability constraints. Therefore, the networks involved in the transport of the data must cooperate to satisfy those constraints. In a next generation Internet, each of those networks may be managed by different entities. Furthermore, their policies and service level agreements (SLAs) will differ, as well as the au...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملFlow equivalence and stochastic equivalence in G-networks
G-networks are novel product form queuing networks that, in addition to ordinary customers, contain unusual entities such as “negative customers” which eliminate normal customers, and “triggers” that move other customers from some queue to another. Recently we introduced one more special type of customer, a “reset”, which may be sent out by any server at the end of a service epoch, and that wil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Communications
دوره 22 شماره
صفحات -
تاریخ انتشار 1999